Hybrid GA for Straight-Line Drawings of Level Clustered Planar Graphs
نویسندگان
چکیده
∗ Corresponding author. Abstract In this paper we introduce an application of genetic algorithms (GAs) with the problem of drawing of level planar graph or hierarchical planar graph, and explore the potential use of GAs to solve this particular problem. Given a l evel planar graph, we want to find a geometric position of every vertex (layout) in a straight-line grid drawing without any edge-intersection. Here we introduce a simple hybrid GA, which nicely draws level planar graph of moderate size. The paper shows that the GAs can help find an layout of levels and hierarchical planar graphs without any crossing edges.
منابع مشابه
Planar Drawing of Clustered Graphs
Graphs are often used to represent relational information. As the amount of information that we want to visualize becomes larger and more complicated, classical graph model tends to be insuucient. In this paper, we introduce and show how to draw a practical and simple graph structure known as clustered graphs. We present an algorithm which produces planar, straight-line, convex drawings of clus...
متن کاملConvex drawings of hierarchical planar graphs and clustered planar graphs
Hierarchical graphs are graphs with layering structures; clustered graphs are graphs with recursive clustering structures. Both have applications in VLSI design, CASE tools, software visualisation and visualisation of social networks and biological networks. Straight-line drawing algorithms for hierarchical graphs and clustered graphs have been presented in [P. Eades, Q. Feng, X. Lin and H. Nag...
متن کاملStraight-Line Rectangular Drawings of Clustered Graphs
We show that every c-planar clustered graph has a straight-line c-planar drawing in which each cluster is represented by an axis-parallel rectangle, thus solving a problem posed by Eades, Feng, Lin, and Nagamochi [Algorithmica, 2006 ].
متن کاملGA for straight-line grid drawings of maximal planar graphs
osting by E Abstract A straight-line grid drawing of a planar graph G of n vertices is a drawing of G on an integer grid such that each vertex is drawn as a grid point and each edge is drawn as a straight-line segment without edge crossings. Finding algorithms for straight-line grid drawings of maximal planar graphs (MPGs) in the minimum area is still an elusive goal. In this paper we explore t...
متن کاملPlanar Drawings and Angular Resolution: Algorithms and Bounds (Extended Abstract)
We investigate the problem of constructing planar straight-line drawings of graphs with large angles between the edges. Namely, we study the angular resolution of planar straight-line drawings, deened as the smallest angle formed by two incident edges. We prove the rst nontrivial upper bound on the angular resolution of planar straight-line drawings, and show a continuous trade-oo between the a...
متن کامل